Saturation problems in the Ramsey theory of graphs, posets and point sets

the analysis of the role of the speech acts theory in translating and dubbing hollywood films

از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...

Finite Presentation of Homogeneous Graphs , Posets and Ramsey Classes

Isoparametric Problems on Graphs and Posets Isoparametric Problems on Graphs and Posets

We consider extremal graph-theoretic problems on regular structures. The problems ask to maximize a certain parameter of the structures in question under the condition that the values of some other parameter(s) are constant. This is where the term isoparametric is taken from. The graph problems we consider are edge-isoperimetric problems, and the poset problems are dealing with the notion of Ma...

on translation of politeness strategies in dialogues involving female characters in translations and retranslations of novels translated before and after the islamic revolution of iran and their effects on the image of women: a polysystem theory approach

abstract reception environment has considerable effects on accepting a translation. as the expectations of a target culture and its values and needs change throughout history, its criteria for accepting a translation or rejecting it will change accordingly (gentzler, 2001). the expectations of iran, as the reception environment in the present study, have changed after the islamic revolution. i...

Extremal Problems on Finite Sets and Posets

The overarching theme of the thesis is the investigation of extremal problems involving forbidden partially ordered sets (posets). In particular, we will be concerned with the function La(n, P ), defined to be the maximum number of sets we can take in the Boolean lattice 2[n] without introducing the relations of a poset P as containment relations among the sets. This function plays an analogous...